package com.binaryTree;

import java.util.LinkedList;
import java.util.Queue;

public class SearchinaBinarySearchTree0305_700 {
    public TreeNode searchBST(TreeNode root, int val) {
        if(root == null) return null;
        if(root.val == val) return root;
        if(root.val > val) return searchBST(root.left,val);
        return searchBST(root.right,val);
    }
}
